Presentations of Topological Full Groups by Generators and Relations

نویسندگان

  • Rostislav Grigorchuk
  • Konstantin Medynets
چکیده

We describe generators and defining relations for the commutator subgroup of topological full groups of minimal subshifts. We show that the world problem in a topological full group is solvable if and only if the language of the underlying subshift is recursive.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Topological Generators for Full Groups of Hyperfinite Pmp Equivalence Relations

We give an elementary proof that there are two topological generators for the full group of every aperiodic hyperfinite probability measure preserving Borel equivalence relation. Our proof explicitly constructs topological generators for the orbit equivalence relation of the irrational rotation of the circle, and then appeals to Dye’s theorem and a Baire category argument to conclude the genera...

متن کامل

Topological properties of full groups

We study full groups of countable, measure-preserving equivalence relations. Our main results include that they are all homeomorphic to the separable Hilbert space and that every homomorphism from an ergodic full group to a separable group is continuous. We also find bounds for the minimal number of topological generators (elements generating a dense subgroup) of full groups allowing us to dist...

متن کامل

Short presentations for alternating and symmetric groups

We derive new families of presentations (by generators and relations) for the alternating and symmetric groups of finite degree n. These include presentations of length that are linear in log n, and 2-generator presentations with a bounded number of relations independent of n.

متن کامل

Presentations of Finite Simple Groups: a Computational Approach

All nonabelian finite simple groups of Lie type of rank n over a field of size q, with the possible exception of the Ree groups G2(q), have presentations with at most 49 relations and bit-length O(log n+log q). Moreover, An and Sn have presentations with 3 generators, 7 relations and bit-length O(log n), while SL(n, q) has a presentation with 6 generators, 25 relations and bit-length O(log n + ...

متن کامل

Infinite groups arising from partial presentations of finite groups

If G is a finite group, X a generating set for G, and R some set of relations holding among these generators (but not in general a full set of relations presenting G), we establish sufficient conditions for the group G∗ = X ! R to be infinite, and give a lower bound for the rank of the abelianization of the kernel of the natural map G∗ → G. Related results in the literature and possible directi...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2015